Upgrading Multilevel Full Cost Allocation: Case Transport

Technology Upgrading with Learning Cost

Adoption of new technology requires diversion of human and physical resources from direct production activities to learning/adjusting activities, which could reduce productivity temporarily. Focusing on the existence of such “learning cost”, we derive a simple model on the optimal timing for technology upgrading. This model suggests that, other things being equal, a firm perceived to have bette...

The budgeted minimum cost flow problem with unit upgrading cost

The budgeted minimum cost flow problem (BMCF(K)) with unit upgrading costs extends the classical minimum cost flow problem by allowing to reduce the cost of at most K arcs. In this paper, we consider complexity and algorithms for the special case of an uncapacitated network with just one source. By a reduction from 3-SAT we prove strong NP-completeness and inapproximability, even on directed ac...

Cost Efficient Upgrading of OPS Nodes

We come back on a technique to build modular switch nodes. This approach allows for a more cost effective expansion of OPS nodes. We give two example designs, showing that the method is useful only for Broadcast & Select OPS nodes when taking price decrease in function of time into account.

Cost Allocation

Congestion-Driven Multilevel Full-Chip Routing Framework

A W-shaped multilevel full-chip routing framework using W-shaped optimization flow is used to find the final routing solution. The W-shaped flow consists of two sequential V-shaped optimization flows. The first V-shaped flow optimizes the global routing solution. The probabilistic congestion prediction technique is used to guide the global routing decision to find the routing solution that even...